
public class Recurssion {

	
	static int calculateFactorial(int num){
		if(num <= 0) {
			return 0;
		}
		if(num ==1 ){
			return 1;
		}
		return num * calculateFactorial(num - 1);
	}
	
	static int findFibonachiNumber(int n){
		if(n <= 0){
			return 0;
		}	
		else if(n == 1){
			return 1;
		}
		return findFibonachiNumber(n -1)+findFibonachiNumber(n-2);
	}
	
		public static void main(String[] args) {
			
			
		//int n = calculateFactorial(6);
		//System.out.println(n);
			
		int num = findFibonachiNumber(7);
		System.out.println(num);
		

	}

}
